Solution to the Problem of Zantema on a Persistent Property of Term Rewriting
نویسنده
چکیده
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system Θ(R), which results from R by omitting its sort information, has the property P . It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort.
منابع مشابه
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P i its underlying term rewriting system (R), which results from R by omitting its sort information, has the property P . It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the posit...
متن کاملA Proof of the Conjecture of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting system is persistent if for any many-sorted term rewriting system R, R has the property P i its underlying term rewriting system (R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sorts. This is the positi...
متن کاملPersistence of Termination for Term Rewriting Systems with Ordered Sorts
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting ...
متن کاملPersistency of Connuence 1
A property P of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS R, R has the property P if and only if its underlying unsorted TRS (R) has the property P. This notion was introduced by H. Zantema (1994). In this paper, it is shown that con uence is persistent.
متن کاملRelative Undecidability in Term Rewriting
For two hierarchies of properties of term rewriting systems related to con uence and termination, respectively, we prove relative undecidability : for implications X ) Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y .
متن کامل